| Algorithms..::SearchForSubsequence<(Of <T>)> Method (IList<(Of <T>)>, IEnumerable<(Of <T>)>) |
| See Also |
| |
[This topic is pre-release documentation and is subject to change in future releases. Blank topics are included as placeholders.]
Searchs a list for a sub-sequence of items that match a particular pattern. A subsequence
of list matches pattern at index i if list[i] is equal to the first item
in pattern, list[i+1] is equal to the second item in pattern,
and so forth for all the items in pattern.
Namespace: Wintellect.PowerCollections
Assembly:
PowerCollections (in PowerCollections.dll)
Syntax
| C# |
|---|
public static int SearchForSubsequence<T>( IList<T> list, IEnumerable<T> pattern ) |
| Visual Basic (Declaration) |
|---|
Public Shared Function SearchForSubsequence(Of T) ( _ list As IList(Of T), _ pattern As IEnumerable(Of T) _ ) As Integer |
| Visual C++ |
|---|
public: generic<typename T> static int SearchForSubsequence ( IList<T>^ list, IEnumerable<T>^ pattern ) |
Parameters
- list
- IList<(Of <T>)>
The list to search.
- pattern
- IEnumerable<(Of <T>)>
The sequence of items to search for.
Return Value
The first index with list that matches the items in pattern.Type Parameters
- T
- The type of items in the list.
Remarks
The default sense of equality for T is used, as defined by T's
implementation of IComparable<T>.Equals or object.Equals.
See Also
Algorithms Class
Wintellect.PowerCollections Namespace
Send comments about this topic to Microsoft.